Lecture notes on quantitative unique continuation for solutions of second order elliptic equations

In these lectures we present some useful techniques to study quantitative properties of solutions of elliptic PDEs. Our aim is to outline a proof of a recent result on propagation of smallness. The ideas are also useful in the study of the zero sets of eigenfunctions of Laplace-Beltrami operator and we discuss the connection. Some basic facts about second order elliptic PDEs in divergent form are collected in the Appendix at the end of the notes.Comment: Lecture notes for Graduate Summer School in Park City (PCMI), July 201

Notes on the distribution of Oculicosa supermirabilis (Araneae, Lycosidae)

The distribution of the poorly known Central Asian wolf-spider Oculicosa supermirabilis Zyuzin, 1993 is clarified, discussed and mapped on the basis of both original and literature-derived data. The species is currently known from the Turan Lowland between the 41st and 43rd degrees of latitude north; its distribution coincides with that of the grey-brown desert soil and lies within the geobotanical sub-zone of southern deserts. Both sexes are also illustrated and diagnosed

Collapsing Superstring Conjecture

In the Shortest Common Superstring (SCS) problem, one is given a collection of strings, and needs to find a shortest string containing each of them as a substring. SCS admits 2 11/23-approximation in polynomial time (Mucha, SODA\u2713). While this algorithm and its analysis are technically involved, the 30 years old Greedy Conjecture claims that the trivial and efficient Greedy Algorithm gives a 2-approximation for SCS. We develop a graph-theoretic framework for studying approximation algorithms for SCS. The framework is reminiscent of the classical 2-approximation for Traveling Salesman: take two copies of an optimal solution, apply a trivial edge-collapsing procedure, and get an approximate solution. In this framework, we observe two surprising properties of SCS solutions, and we conjecture that they hold for all input instances. The first conjecture, that we call Collapsing Superstring conjecture, claims that there is an elementary way to transform any solution repeated twice into the same graph G. This conjecture would give an elementary 2-approximate algorithm for SCS. The second conjecture claims that not only the resulting graph G is the same for all solutions, but that G can be computed by an elementary greedy procedure called Greedy Hierarchical Algorithm. While the second conjecture clearly implies the first one, perhaps surprisingly we prove their equivalence. We support these equivalent conjectures by giving a proof for the special case where all input strings have length at most 3 (which until recently had been the only case where the Greedy Conjecture was proven). We also tested our conjectures on millions of instances of SCS. We prove that the standard Greedy Conjecture implies Greedy Hierarchical Conjecture, while the latter is sufficient for an efficient greedy 2-approximate approximation of SCS. Except for its (conjectured) good approximation ratio, the Greedy Hierarchical Algorithm provably finds a 3.5-approximation, and finds exact solutions for the special cases where we know polynomial time (not greedy) exact algorithms: (1) when the input strings form a spectrum of a string (2) when all input strings have length at most 2